On updates of high order cumulant tensors

نویسندگان

  • Krzysztof Domino
  • Piotr Gawron
چکیده

High order cumulants carry information about statistics of non–normally distributed multivariate data. Such cumulants are utilised in extreme events analysis, small target detection or outliers detection. In this work we present a new algorithm,for updating high order cumulant tensors of random multivariate data, if new package of data is recorded. We show algebraically and numerically, that the proposed algorithm is faster than a naïve cumulants recalculation algorithm. For investigated computer generated data our algorithm appears to be fasten than a naïve one by 1 − 2 orders of magnitude. That update algorithm makes the online updates of multivariate data statistics much faster, and can be used for the data streaming analysis. Further we propose the map reduce algorithm of cumulants calculation, that is based on introduced cumulants updates algorithm. This map reduce algorithm can be used to collect statistics about multivariate confidential data that are held by many agents, without sharing those data. ∗[email protected][email protected] 1 ar X iv :1 70 1. 06 44 6v 1 [ cs .D S] 2 0 Ja n 20 17

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Improved Cumulant Based Method for Independent Component Analysis

An improved method for independent component analysis based on the diagonalization of cumulant tensors is proposed. It is based on Comon’s algorithm [1] but it takes thirdand fourth-order cumulant tensors into account simultaneously. The underlying contrast function is also mathematically much simpler and has a more intuitive interpretation. It is therefore easier to optimize and approximate. A...

متن کامل

The tensor network representation of high order cumulant and algorithm for their calculation

In this paper we introduce a novel algorithm of calculating arbitrary order cumulants of multidimensional data. Since the n order cumulant can be presented in the form of an n-dimensional tensor, the algorithm is presented using the tensor network notation. The presented algorithm exploits the super–symmetry of cumulant and moment tensors. We show, that proposed algorithm highly decreases the c...

متن کامل

Hiding higher order cross-correlations of multivariate data using Archimedean copulas

In this paper we present the algorithm that changes the subset of marginals of multivariate normal distributed data into such modelled by an Archimedean copula. Proposed algorithm leaves a correlation matrix almost unchanged, but introduces a higher order crosscorrelation measured by high order multivariate cumulant tensors. Given the algorithm, we analyse the ability of cumulants based feature...

متن کامل

Independent component analysis and (simultaneous) third-order tensor diagonalization

Comon’s well-known scheme for independent component analysis (ICA) is based on the maximal diagonalization, in a least-squares sense, of a higher-order cumulant tensor. In a previous papr, we proved that for fourth-order cumulants, the computation of an elementary Jacobi rotation is equivalent to the computation of the best rank-1 approximation of a fourth-order tensor. In this paper, we show t...

متن کامل

Principal Cumulant Component Analysis

Multivariate Gaussian data is completely characterized by its mean and covariance, yet modern non-Gaussian data makes higher-order statistics such as cumulants inevitable. For univariate data, the third and fourth scalar-valued cumulants are relatively well-studied as skewness and kurtosis. For multivariate data, these cumulants are tensor-valued, higher-order analogs of the covariance matrix c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1701.06446  شماره 

صفحات  -

تاریخ انتشار 2017